package the.offer.leetcode;

import java.util.TreeMap;

public class SolutionOfString {

    public int lengthOfLongestSubstring(String s) {
        TreeMap<Character, Integer> map = new TreeMap<>();

        return 0;
    }


    /**
     * @param path path = "/home/", => "/home"
     *             path = "/a/./b/../../c/", => "/c"
     *             path = "/../", => "/"
     *             path = "/home//foo/", => "/home/foo"
     */
    public String simplifyPath(String path) {
        return null;
    }
}
